The balanced decomposition number of TK_{4} and series -parallel graphs
نویسندگان
چکیده
منابع مشابه
The balanced decomposition number of TK4 and series -parallel graphs
A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, say red and blue, such that there is the same number of vertices in each colour. The balanced decomposition number f(G) of G is the minimum integer s with the following property: For any balanced colouring of G, there is a partition V (G) = V1 ∪̇ · · · ∪̇Vr such that, for every i, Vi induces a connecte...
متن کاملParallel Decomposition of Generalized Series-Parallel Graphs
Received July 17, 1997; accepted May 1, 1998. Communicated by Wen-Lian Hsu. *A preliminary version of this paper appeared in the proceedings of the International Conference on Parallel and Distributed Processing Techniques and Applications (PDPTA’97) Las Vegas, Nevada, pp. 890-896, 1997. Research supported in part by NSC under Grant 83-0408-E-008-004. JOURNAL OF INFORMATION SCIENCE AND ENGINEER...
متن کاملOn the balanced decomposition number
A balanced coloring of a graph G means a triple {P1, P2,X} of mutually disjoint subsets of the vertex-set V (G) such that V (G) = P1⊎P2⊎X and |P1| = |P2|. A balanced decomposition associated with the balanced coloring V (G) = P1⊎P2⊎X of G is defined as a partition of V (G) = V1⊎· · ·⊎Vr (for some r) such that, for every i ∈ {1, · · · , r}, the subgraphG[Vi] of G is connected and |Vi∩P1| = |Vi∩P...
متن کاملOn the Number of Series Parallel and Outerplanar Graphs
We show that the number gn of labelled series-parallel graphs on n vertices is asymptotically gn ∼ g · n−5/2γnn!, where γ and g are explicit computable constants. We show that the number of edges in random seriesparallel graphs is asymptotically normal with linear mean and variance, and that the number of edges is sharply concentrated around its expected value. Similar results are proved for la...
متن کاملThe Balanced Decomposition Number and Vertex Connectivity
The balanced decomposition number f(G) of a graph G was introduced by Fujita and Nakamigawa [Discr. Appl. Math., 156 (2008), pp. 3339-3344]. A balanced colouring of a graph G is a colouring of some of the vertices of G with two colours, such that there is the same number of vertices in each colour. Then, f(G) is the minimum integer s with the following property: For any balanced colouring of G,...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discussiones Mathematicae Graph Theory
سال: 2013
ISSN: 1234-3099,2083-5892
DOI: 10.7151/dmgt.1666